Stationary quantum source coding
نویسنده
چکیده
In this paper the quantum version of the source coding theorem is obtained for a completely ergodic source. This result extends Schumacher’s quantum noiseless coding theorem for memoryless sources. The control of the memory effects requires some earlier results of Hiai and Petz on high probability subspaces. Our result is equivalently considered as a compression theorem for noiseless stationary channels.
منابع مشابه
ua nt - p h / 99 12 10 3 v 1 2 2 D ec 1 99 9 Stationary quantum source coding
In this paper the quantum version of the source coding theorem is obtained for a completely ergodic source. This results extends Shannon’s classical theorem as well as Schumacher’s quantum noiseless coding theorem for memoryless sources. The control of the memory effects requires some earlier results of Hiai and Petz on high probability subspaces.
متن کاملDistortion-rate bounds for fixed- and variable-rate multiresolution source codes
The source coding theorem for stationary sources describes the optimal performance theoretically achievable by fixedand variable-rate block quantizers. The source coding theorem may be generalized by considering the problem of multiresolution or successive refinement source coding, which is the topic of this work. Given a distortion vector (D1; ; DL), this work describes the family of achievabl...
متن کاملUniversal coding for classical-quantum channel
We construct a universal code for stationary and memoryless classicalquantum channel as a quantum version of the universal coding by Csiszár and Körner. Our code is constructed by the combination of irreducible representation, the decoder introduced through quantum information spectrum, and the packing lemma.
متن کاملNoiseless coding theorem proved by induction for finite stationary memoryless information sources
Noiseless coding theorem for finite stationary memoryless information sources is proved by using induction on the number of source symbols and the inequality of geometric and harmonic means.
متن کاملFinite-state adaptive block to variable-length noiseless coding of a nonstationary information source
1259 Ahsfracf-We associate with a given nonstationary finite-alphabet information source a certain class of stationary processes which we term the stationary hull of the given source. It is then shown that the optimum average rate at which the given source can be noiselessly coded via finite-state adaptive block to variable-length coding schemes is the largest entropy rate among those processes...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999